P vs NP Problem in the field anthropology
نویسنده
چکیده
This is an attempt of a new kind of anthropology, inspired by assumption that P is not NP, and, where anthropological field (experimental) study is considered as a search of a new complexity classes, in particularly, complexity class M.
منابع مشابه
Independence of P vs. NP in regards to oracle relativizations
Previously in “P is a proper subset of NP” [Meek Article 1 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizatio...
متن کاملAnthropological Study of Folk Music in Gilan Province in Iran (Instrumental Music)
Ethno-musicology is an academic field encompassing various approaches to the study of music that emphasize its cultural, social, material, cognitive, biological, and other dimensions or contexts instead of its isolated ‘sound’ component or any particular repertoire. The term ‘Ethno-musicology’ became common in1950, although the emergence of the field can be traced back to the late nineteenth ce...
متن کاملM ay 2 00 8 Independence of P vs . NP in regards to oracle
Previously in “P is a proper subset of NP” [Meek Article 1, 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2, 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizat...
متن کاملGeometric Complexity Theory VI: The flip via positivity
Geometric complexity theory (GCT) is an approach towards the P vs. NP and related problems. The article [GCTflip] describes its defining strategy, called the flip, to resolve the self referential paradox, which is the root difficulty in these problems. This article describes an approach based on positivity hypotheses in algebraic geometry and representation theory to implement the flip and ther...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0904.3074 شماره
صفحات -
تاریخ انتشار 2009